Radius of Trust

A New Strategy for Choosing the Radius Adjusting Parameters in Trust Region Methods

Trust region methods are a class of important and efficient methods for solving unconstrained optimization problems. The efficiency of these methods strongly depends on the initial parameter, especially radius adjusting parameters. In this paper, we propose a new strategy for choosing the radius adjusting parameters. Numerical results from testing the new idea to solve a class of unconstrained ...

Radius Mass Position of Radius

A Trust Region Algorithm Model With Radius Bounded Below for Minimization of Locally Lipschitzian Functions∗

The classical trust region algorithm was extended to the nonsmooth minimization problem successful by Qi and Sun. Combining the trust region algorithm of Qi and Sun and the trust region algorithm with radius bounded below of Jiang for solving generalized complementarity problems, this paper present a new trust region algorithm with radius bounded below for the unconstrained nonsmooth optimizati...

A Nonmonotone trust region method with adaptive radius for unconstrained optimization problems

In this paper, we incorporate a nonmonotone technique with the new proposed adaptive trust region radius (Shi and Guo, 2008) [4] in order to propose a new nonmonotone trust region method with an adaptive radius for unconstrained optimization. Both the nonmonotone techniques and adaptive trust region radius strategies can improve the trust region methods in the sense of global convergence. The g...

On spectral radius of strongly connected digraphs

 It is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. In this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.